Partitioned Garbage Collection of a Large Object Store

Garbage Collecting Persistent Object Stores

Many techniques have been devised for garbage collecting main memory heaps for programming languages, and there has more recently been progress on distributed garbage collection, for sets of long-lived processes in distributed systems. Little attention has been paid to garbage collecting large persistent stores, however. A persistent store is essentially a shared heap that outlives the executio...

Efficient Garbage Collection for Large Object - Oriented Databases

This thesis presents the design of an efficient garbage collection scheme for large, persistent object-oriented databases in a client-server environment. The scheme uses a partitioned approach. A database is divided into disjoint partitions and each partition is collected independently. The scheme maintains transaction semantics and survives server crashes. It can be run concurrently with clien...

The Performance of Partitioned Garbage Collection in Object Databases ; CU-CS-653-93

PMOS: A Complete and Coarse-Grained Incremental Garbage Collector for Persistent Object Stores

Traditional garbage collection techniques designed for language systems operating over transient data do not readily migrate to a persistent context. The size, complexity, and permanence characteristics of a persistent object store mean that an automatic storage reclamation system, in addition to ensuring that all unreachable and only unreachable data is reclaimed, must also maintain store cons...

PMOS Revisited

The Persistent Mature Object Space, PMOS, garbage collection algorithm is designed to incrementally collect all garbage in a potentially large persistent object store. The goal of the PMOS algorithm is to break the collection of garbage into small enough units so that disruption to the running system is insignificant. PMOS is able to collect the small units in arbitrary orders whilst eliminatin...